package com.gxgeek.algorithm.t2.test;

/**
 * Created by gx on 2017/5/8.
 */
public class Graph {

    //顶点数组
    private Vertex [] vertexList;

    //连接矩阵

    private int [][] adjMart;

    // 顶点的最大数目
    private int maxSize;

    //当前顶点
    private  int nVertex;


    public  Graph(){
        vertexList = new Vertex[maxSize];
    }
}
